Shape-Faithful Graph Drawings

Shape-based metrics measure how faithfully a drawing D represents the structure of graph G, using proximity S D. While some limited classes admit drawings (i.e., optimally shape-faithful drawings, where $$S = G$$ ), algorithms for general graphs have not been investigated. In this paper, we present first study graphs. First, conduct extensive comparison experiments popular layouts shape-based metrics, and examine properties highly drawings. Then, ShFR ShSM, based on force-directed stress-based algorithms, by introducing new forces/stress. Experiments show that ShSM obtain significant improvement over FR (Fruchterman-Reingold) SM (Stress Majorization), average 12% 35% respectively, metrics.